Deciding Nondeterministic Hierarchy of Deterministic Tree Automata
نویسندگان
چکیده
منابع مشابه
Reduction of Nondeterministic Tree Automata
We present an efficient algorithm to reduce the size of nondeterministic tree automata, while retaining their language. It is based on new transition pruning techniques, and quotienting of the state space w.r.t. suitable equivalences. It uses criteria based on combinations of downward and upward simulation preorder on trees, and the more general downward and upward language inclusions. Since tr...
متن کاملEquivalence of Deterministic and Nondeterministic Epsilon Automata
For simplicity, we adopt the following convention: x, y, X denote sets, E denotes a non empty set, e denotes an element of E, u, u1, v, v1, v2, w denote elements of Eω, F denotes a subset of Eω, i, k, l denote natural numbers, T denotes a non empty transition-system over F , and S, T denote subsets of T. One can prove the following propositions: (1) If i ≥ k + l, then i ≥ k. (2) For all finite ...
متن کاملDeciding Equivalence of Deterministic Pushdown Automata
Deterministic pushdown automata (DPDA) are a class of simple yet powerful models of computation. It has a finite set of states and a (pushdown) stack. Depending on the current state, the symbol at the top of the stack, and the symbol of the input word that has just been scanned, the automaton moves to a new state, either pushes or pops a symbol on the stack, and it is ready to scan the next sym...
متن کاملExplorer Reduction of Nondeterministic Tree Automata
We present an efficient algorithm to reduce the size of nondeterministic tree automata, while retaining their language. It is based on new transition pruning techniques, and quotienting of the state space w.r.t. suitable equivalences. It uses criteria based on combinations of downward and upward simulation preorder on trees, and the more general downward and upward language inclusions. Since tr...
متن کاملRandom Generation of Nondeterministic Tree Automata
Algorithms for (nondeterministic) finite-state tree automata (NTA) are often tested on random NTA, in which all internal transitions are equiprobable. The run-time results obtained in this manner are usually overly optimistic as most such generated random NTA are trivial in the sense that the number of states of an equivalent minimal deterministic finite-state tree automaton is extremely small....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2005
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2004.05.015